A Simple Parallel Dictionary Matching Algorithm
نویسنده
چکیده
In the Parallel Dictionary Matching problem a set of patterns D is xed at the beginning, and the following Query(T) operation has to be quickly supported: given an arbitrary text T 1; t], for each text position i retrieve the longest pattern in D that is a preex of T i; t]. In this paper, we present a simple and space-eecient CRCW PRAM algorithm which takes optimal work to answer Query(T) in the case of a constant-sized alphabet. Furthermore, we show how to extend our results to the case of a general alphabet by applying a well-known technique.
منابع مشابه
5.2 Dynamic Matching 5.1 Parallel Static Dictionary Matching 3.2 Compressed Tries 4 Trie Based Dictionary Matching Algorithm 4.1 a Separator Decomposition Tree 3.1 Denition and Construction
The standard string matching problem involves nding all occurrences of a single pattern in a single text. While this approach works well in many application areas, there are some domains in which it is more appropriate to deal with dictionaries of patterns. A dictionary is a set of patterns; the goal of dictionary matching is to nd all dictionary patterns in a given text, simultaneously. In str...
متن کاملAn Improved Semantic Schema Matching Approach
Schema matching is a critical step in many applications, such as data warehouse loading, Online Analytical Process (OLAP), Data mining, semantic web [2] and schema integration. This task is defined for finding the semantic correspondences between elements of two schemas. Recently, schema matching has found considerable interest in both research and practice. In this paper, we present a new impr...
متن کاملSpeech Enhancement using Adaptive Data-Based Dictionary Learning
In this paper, a speech enhancement method based on sparse representation of data frames has been presented. Speech enhancement is one of the most applicable areas in different signal processing fields. The objective of a speech enhancement system is improvement of either intelligibility or quality of the speech signals. This process is carried out using the speech signal processing techniques ...
متن کاملSimple and Efficient Algorithm for Approximate Dictionary Matching
This paper presents a simple and efficient algorithm for approximate dictionary matching designed for similarity measures such as cosine, Dice, Jaccard, and overlap coefficients. We propose this algorithm, called CPMerge, for the τ overlap join of inverted lists. First we show that this task is solvable exactly by a τ -overlap join. Given inverted lists retrieved for a query, the algorithm coll...
متن کاملAligning Noisy Parallel Corpora Across Language Groups : Word Pair Feature Matching by Dynamic Time Warping
We propose a new algorithm, DK-vec, for aligning pairs of Asian/Indo-European noisy parallel texts without sentence boundaries. The algorithm uses frequency, position and recency information as features for pattern matching. Dynamic Time Warping is used as the matching technique between word pairs. This algorithm produces a small bilingual lexicon which provides anchor points for alignment.
متن کامل